A Circuit Complexity Approach to Transductions

نویسندگان

  • Michaël Cadilhac
  • Andreas Krebs
  • Michael Ludwig
  • Charles Paperman
چکیده

We investigate the deterministic rational transductions computable by constant-depth, polysize circuits. To this end, we first propose a framework of independent interest to express functions of variable output length using circuits, and argue for its pertinence. We then provide a general characterization of the set of transductions realizable by such circuits, relying on a notion of continuity. We deduce that it is decidable whether a transduction is definable in AC and, assuming a well-established conjecture, the same for ACC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach for Low Voltage CMOS based on Current-controlled Conveyors

Abstract  In his paper a new current-controlled conveyor (CCCII) in CMOS technology is presented. It features, low supply voltage (±0.7), low power consumption, low circuit complexity, rail to rail operation and wide range parasitic resistance ( ). The circuit has been successfully employed in a multifunction biquad filter. Simulation results by HSPICE show high performance of the circuit and c...

متن کامل

Class-AB Square-Root Domain Filters Based on the Floating

In this paper a new approach for design of class-AB current-mode square-root domain filters based on the electronically simulated translinear loop principle is presented. FG-MOS transistors that operate in strong inverted saturation region are employed for implementation of translinear loop circuit. The filter achieves immunity to body effect, low circuit complexity, large input dynamic ran...

متن کامل

Learning Local Transductions Is Hard

Local deterministic string-to-string transductions are generalizations of morphisms on free monoids. Learning local transductions reduces to inference of monoid morphisms. However, learning a restricted class of morphisms, the so-called fine morphisms, is an intractable problem, because the decision version of the empirical risk minimization problem contains an NP-complete subproblem.

متن کامل

A Micropower Current-Mode Euclidean Distance Calculator for Pattern Recognition

In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...

متن کامل

Hardwar Trojan classification and implementation and offer a new detection approach

A hardware attack that enables the attacker to alter the main circuit with malicious hardware during either design or the fabrication process is studied and analyzed. This attack, known as the hardware Trojan, has different objectives such as destroying hardware, changing circuit characteristics or extracting sensitive information. So hardware Trojan detection and hardware security are critical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015